Constructing uniform designs: A heuristic integer programming method
نویسندگان
چکیده
منابع مشابه
A method for constructing generalised residual designs
A t-design rc with parameters t (u, k, A) is a finite incidence structure with u points and k points on each block such that any t-subset is contained in exactly 1 blocks. Incidence between a point P and a block d is denoted by P 1 d or d 1 P. We usually denote by b the number of blocks of 17. A block p of a t-design (t > 1) is said to be repeated x times if there exists exactly x blocks d such...
متن کاملA provably convergent heuristic for stochastic bicriteria integer programming
We propose a general-purpose algorithm APS (Adaptive Pareto-Sampling) for determining the set of Pareto-optimal solutions of bicriteria combinatorial optimization (CO) problems under uncertainty, where the objective functions are expectations of random variables depending on a decision from a finite feasible set. APS is iterative and population-based and combines random sampling with the soluti...
متن کاملPivot-and-Fix; A Mixed Integer Programming Primal Heuristic
Pivot-and-Fix, a new primal heuristic for finding feasible solutions for mixed integer programming (MIP) problems is presented in this paper. Pivot-and-Fixtries to explore potentially promising extreme points of the polyhedron of the problem and by forming smaller serach trees looks for integer feasible solutions. Computational results show that this heuristic could help MIP solvers to perform ...
متن کاملA Provably Convergent Heuristic for Bicriteria Stochastic Integer Programming
The area of combinatorial optimization has been enlarged in the recent years into two directions: First, a huge number of articles deals with multiobjective combinatorial optimization (MOCO) problems, for which techniques to determine the set of Pareto-optimal solutions have been developed (cf., e.g., [6], [3]). A major advantage of MOCO approaches is that they are able to provide the decision ...
متن کاملConstructing designs using the union method
Given a design V, other designs can be constructed by using unions of various sets of blocks as new blocks. This method of constructing designs is referred to as "the union method". In general, the constructed design has neither constant blocksize nor balance properties. Various situations in which balanced incomplete block designs (BIBD's) and group divisible designs (GDD's) can be constructed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2012
ISSN: 0885-064X
DOI: 10.1016/j.jco.2011.10.005